Asymptotic variance of stationary reversible and normal Markov processes
نویسندگان
چکیده
منابع مشابه
Markov Infinitely-Divisible Stationary Time-Reversible Integer-Valued Processes
We characterize all stationary time reversible Markov processes whose finite dimensional marginal distributions (of all orders) are infinitely divisible– MISTI processes, for short. Aside from two degenerate cases (iid and constant), in both discrete and continuous time every such process with full support is a branching process with Poisson or Negative Binomial marginal univariate distribution...
متن کاملStationary Markov Processes
We consider some classes of stationary, counting{measure{valued Markov processes and their companions under time{reversal. Examples arise in the L evy{It^ o decomposition of stable Ornstein{Uhlenbeck processes, the large{time asymptotics of the standard additive coalescent, and extreme value theory. These processes share the common feature that points in the support of the evolving counting{ me...
متن کاملAsymptotic theory for stationary processes
In the study of random processes, dependence is the rule rather than the exception. To facilitate the related statistical analysis, it is necessary to quantify the dependence between observations. In the talk I will briefly review the history of this fundamental problem. By interpreting random processes as physical systems, I will introduce physical and predictive dependence coefficients that q...
متن کاملAsymptotic Inference of Autocovariances of Stationary Processes
Abstract: The paper presents a systematic theory for asymptotic inference of autocovariances of stationary processes. We consider nonparametric tests for serial correlations based on the maximum (or L∞) and the quadratic (or L2) deviations. For these two cases, with proper centering and rescaling, the asymptotic distributions of the deviations are Gumbel and Gaussian, respectively. To establish...
متن کاملCLTs and asymptotic variance of time-sampled Markov chains
Abstract: For a Markov transition kernel P and a probability distribution μ on nonnegative integers, a time-sampled Markov chain evolves according to the transition kernel Pμ = ∑ k μ(k)P k. In this note we obtain CLT conditions for time-sampled Markov chains and derive a spectral formula for the asymptotic variance. Using these results we compare efficiency of Barker’s and Metropolis algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2015
ISSN: 1083-6489
DOI: 10.1214/ejp.v20-3183